Approximation of the Quadratic Knapsack Problem
نویسندگان
چکیده
منابع مشابه
Approximation of the Quadratic Knapsack Problem
We study the approximability of the classical quadratic knapsack problem (QKP) on special graph classes. In this case the quadratic terms of the objective function are not given for each pair of knapsack items. Instead an edge weighted graph G = (V, E) whose vertices represent the knapsack items induces a quadratic profit p ij for the items i and j whenever they are adjacent in G (i.e (i, j) ∈ ...
متن کاملApproximation of the Quadratic Knapsack Problem
We study the approximability of the classical quadratic knapsack problem (QKP) on special graph classes. In this case the quadratic terms of the objective function are not given for each pair of knapsack items. Instead an edge weighted graph G = (V, E) whose vertices represent the knapsack items induces a quadratic profit pij for the items i and j whenever they are adjacent in G (i.e (i, j) ∈ E...
متن کامل$O(n^{2/5})$ Approximation of the Quadratic Knapsack Problem
For any given > 0 we provide an algorithm for the Quadratic Knapsack Problem that has an approximation ratio within O(n ) and a run time within O(n ).
متن کاملExact Solution of the Quadratic Knapsack Problem
The Quadratic Knapsack Problem (QKP) calls for maximizing a quadratic objective function subject to a knapsack constraint, where all coeecients are assumed to be nonnegative and all variables are binary. The problem has applications in location and hydrology, and generalizes the problem of checking whether a graph contains a clique of a given size. We propose an exact branch-and-bound algorithm...
متن کاملAsymptotic behavior of the quadratic knapsack problem
We study subclasses of the quadratic knapsack problem, where the profits are independent random variables defined on the interval [0, 1] and the knapsack capacity is proportional to the number of items (we assume that the weights are arbitrary numbers from the interval [0, 1]). We show asymptotically that the objective value of a very easy heuristic is not far away from the optimal solution. Mo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 2016
ISSN: 0167-6377
DOI: 10.1016/j.orl.2016.05.005